Equilibrium Points in N - Person Games

نویسنده

  • John Simon
چکیده

* This note arose from consultations during the tenure of a John Simon Guggenheim Memorial Fellowship by MacLane. ' Whitehead, J. H. C., "Combinatorial Homotopy I and II," Bull. A.M.S., 55, 214-245 and 453-496 (1949). We refer to these papers as CH I and CH II, respectively. ' By a complex we shall mean a connected CW complex, as defined in §5 of CH I. We do not restrict ourselres to finite complexes. A fixed 0-cell e° e KO will be the base point for all the homotopy groups in K. 4 MacLane, S., "Cohomology Theory in Abstract Groups III," Ann. Math., 50, 736-761 (1949), referred to as CT III. ' An (unpublished) result like Theorem 1 for the homotopy type was obtained prior to these results by J. A. Zilber. CT III uses in place of. equation (2.4) the stronger hypothesis that XB contains the center of A, but all the relevant developments there apply under the weaker assumption (2.4). I Eilenberg, S., and MacLane, S., "Cohomology Theory in Abstract Groups II," Ann. Math., 48, 326-341 (1947). 8 Eilenberg, S., and MacLane, S., "Determination of the Second Homology ... by Means of Homotopy Invariants," these PROCEEDINGS, 32, 277-280 (1946). 9 Blakers, A. L., "Some Relations Between Homology and Homotopy Groups," Ann. Math., 49, 428-461 (1948), §12. 10 The hypothesis of Theorem C, requiring that v(1) not be cyclic, can be readily realized by suitable choice of the free group X, but this hypothesis is not needed here (cf. 6). 11 Eilenberg, S., and MacLane, S., "Homology of Spaces with Operators II," Trans. A.M.S., 65, 49-99 (1949); referred to as HSO II. 12C(k) here is the C(K) of CH II. Note that K exists and is a CW complex by (N) of p. 231 of CH I and that p-'K' K", where p is the projection p:K -K. 13 Whitehead, J. H. C., "Simple Homotopy Types." If W = 1, Theorem 5 follows from (17:3) on p. 155 of S. Lefschetz, Algebraic Topology, (New York, 1942) and arguments in §6 of J. H. C. Whitehead, "On Simply Connected 4-Dimensional Polyhedra" (Comm. Math. Helv., 22, 48-92 (1949)). However this proof cannot be generalized to the case W # 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal elements of $mathscr{F}_{C,theta}$-majorized mappings and applications to‎ ‎generalized games

In the paper‎, ‎some new existence theorems of maximal elements for‎ ‎$mathscr{F}_{C,theta}$-mappings and $mathscr{F}_{C,theta}$-majorized mappings are established‎. ‎As applications, ‎some new existence theorems of equilibrium points for‎ ‎one-person games‎, ‎qualitative games and generalized games are obtained‎. ‎Our results unify and generalize most known results‎ ‎in recent literature‎.

متن کامل

An Observation related to the method of Lemke-Hobson

Introduction Even though Nash´s theorem asserts the existence of equilibrium points for the mixed extension of a normal game, it does not tell us how to find them. Even in the case of two matrices or two person games many algorithms have been proposed by Vorobev[13], Kuhn[3] and Mangasarian[5] to determine all equilibrium pairs, they are more of theoretical interest than for actual computation....

متن کامل

A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games

Abstract   This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...

متن کامل

Nonzero - Sum Stochastic Games

This paper extends the basic work that has been done on tero-sum stochastic games to those that are nonzerosum. Appropriately defined equilibrium points are shown to exist for both the case where the players seek to maximize the total value of their discounted period rewards and the case where they wish to maximize their average reward per period. For the latter case, conditions required on the...

متن کامل

An Algorithmic Solution of N-Person Games

function is a function which estimates what resulting value Two-person, perfect information, constant sum games have been studied in Artificial Intelligence. This paper opens up the issue of playing n-person games and proposes a procedure for constant sum or non-constant sum games. It is proved that a procedure, max”, locates an equilibrium point given the entire game tree. The minimax procedur...

متن کامل

Vehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach

Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005